Functional central limit theorem for subgraph counting processes
نویسندگان
چکیده
منابع مشابه
Central Limit Theorem for Stationary Linear Processes
We establish the central limit theorem for linear processes with dependent innovations including martingales and mixingale type of assumptions as defined in McLeish [Ann. In doing so we shall preserve the generality of the coefficients, including the long range dependence case, and we shall express the variance of partial sums in a form easy to apply. Ergodicity is not required.
متن کاملCentral Limit Theorem for Nonlinear Hawkes Processes
Hawkes process is a self-exciting point process with clustering effect whose jump rate depends on its entire past history. It has wide applications in neuroscience, finance and many other fields. Linear Hawkes process has an immigration-birth representation and can be computed more or less explicitly. It has been extensively studied in the past and the limit theorems are well understood. On the...
متن کاملA Functional Central Limit Theorem for The
In this paper, we present a functional fluid limit theorem and a functional central limit theorem for a queue with an infinity of servers M/GI/∞. The system is represented by a point-measure valued process keeping track of the remaining processing times of the customers in service. The convergence in law of a sequence of such processes after rescaling is proved by compactness-uniqueness methods...
متن کاملA functional central limit theorem for PEPA
We present a functional central limit theorem which quantifies, as a stochastic process, the difference between a PEPA model’s underlying CTMC and its fluid approximation. We generalise existing theory to handle the case of non-smooth rate functions, which is an issue particular to modelling problems in computer science. We verify the weak convergence empirically and suggest future avenues for ...
متن کاملA functional combinatorial central limit theorem
The paper establishes a functional version of the Hoeffding combinatorial central limit theorem. First, a pre-limiting Gaussian process approximation is defined, and is shown to be at a distance of the order of the Lyapounov ratio from the original random process. Distance is measured by comparison of expectations of smooth functionals of the processes, and the argument is by way of Stein’s met...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2017
ISSN: 1083-6489
DOI: 10.1214/17-ejp30